class Node:
    left = 0
    right = 0
    mul = 0

def getKey(node):
    return node.mul

n = int(input())
a, b = map(int, input().split())
arr = []
for i in range(0, n):
    node = Node()
    node.left, node.right = map(int, input().split())
    node.mul = node.left * node.right
    arr.append(node)
arr.sort(key = getKey)
nmax = 0
for i in range(0, n):
    nmax = max(nmax, a // arr[i].right)
    a *= arr[i].left
print(nmax)